Efficient Probing Techniques for Fault Diagnosis

Abstract — Increase in the network usage and the widespread application of networks for more and more performance critical applications has caused a demand for tools that can monitor network health with minimum management traffic. Adaptive probing holds a potential to provide effective tools for end-toend monitoring and fault diagnosis over a network. In this paper we present adaptive probing tools that meet the requirements to provide an effective and efficient solution for fault diagnosis. In this paper, we propose adaptive probing based algorithms to perform fault localization by adapting the probe set to localize the faults in the network. We compare the performance and efficiency of the proposed algorithms through simulation results

Interoperability Issues in Heterogeneous Network Management

The presence of dissimilar network models and standards necessitates interoperability as a means of achieving ubiquitous connectivity and management. The primary focus of this paper is to identify interoperability issues, independent of the network management model, which form the basis for developing interworking paradigms. Network Management and Interoperability related concepts and terminology are introduced and a generic network management framework is presented. Based on the generic framework, interoperability issues for developing paradigms are identified systematically. Different paradigms for interoperability are described and compared. The techniques used by these paradigms in addressing the issues identified are discussed. Keywords: Network Management, Interoperability, Management Framework, MIB mapping, Protocol Translation, Application Gateway. 1 Introduction The evolution of computer networks was driven by the fundamental human need for communication and the promise of c..

A Model for Virtual Tree Bandwidth Allocation in ATM Networks

The technique of Virtual Paths is used in ATM networks to perform bandwidth allocation for virtual circuits and to simplify setting up of virtual circuits in response to connection requests. In this paper, we describe a new technique called Virtual Trees that can be used for bandwidth allocation in ATM networks. A Virtual Tree corresponds to pre-allocated bandwidth along a set of links in the network that form a tree rooted at a source node and leading to various destinations. The use of Virtual Trees provides more flexibility to a source node in setting up a virtual circuit and results in smaller rejection probabilities for connection requests. Virtual Trees retain all the advantages of Virtual Paths but have a better performance potential. We present an optimization model for Bandwidth Allocation for Virtual Tree configurations and present the results of a simulation study comparing the performance of Virtual Trees with that of Virtual Paths. 1 Introduction The Asynchronous Transfer..

Abstract

A mobile ad-hoc network creates a dynamic environment where node mobility can cause periodic changes in routes. Most existing fault localization algorithms assume availability of complete and/or deterministic dependency model. Such assumptions can not be made in the dynamically changing networks. This paper is aimed at developing a fault diagnosis architecture and algorithm to address the issue of dynamically changing dependencies in networks. We propose an architecture to capture the changes in the dependencies and introduce a temporal correlation algorithm to perform fault diagnosis with the dynamically changing dependency information. We present an experimental evaluation of our work through simulation results using Qualnet. I